Derivation of algorithms for cutwidth and related graph layout parameters
نویسندگان
چکیده
منابع مشابه
Derivation of algorithms for cutwidth and related graph layout parameters
In this paper, we investigate algorithms for some related graph parameters. Each of these asks for a linear ordering of the vertices of the graph (or can be formulated as such), and constructive linear time algorithms for the fixed parameter versions of the problems have been published for several of these. Examples are cutwidth, pathwidth, and directed or weighted variants of these. However, t...
متن کاملAlgorithms for string and graph layout
Many graph optimization problems can be viewed as graph layout problems. A layout of a graph is a geometric arrangement of the vertices subject to given constraints. For example, the vertices of a graph can be arranged on a line or a circle, on a twoor three-dimensional lattice, etc. The goal is usually to place all the vertices so as to optimize some specified objective function. We develop co...
متن کاملtechnical and legal parameters for determination of river boundary,( case study haraz river)
چکیده با توسعه شهر نشینی و دخل و تصرف غیر مجاز در حریم رودخانه ها خسارات زیادی به رودخانه و محیط زیست اطراف آن وارده می شود. در حال حاضر بر اساس آئین نامه اصلاح شده بستر و حریم رودخانه ها، حریم کمی رودخانه که بلافاصله پس از بستر قرار می گیرد از 1 تا20 متر از منتهی الیه طرفین بستر رودخانه تعیین، که مقدار دقیق آن در هر بازه از رودخانه مشخص نیست. در کشورهای دیگر روشهای متفاوتی من جمله: درصد ریسک...
15 صفحه اولStarting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms
This paper investigates algorithms for some related graph parameters. Each asks for a linear ordering of the vertices of the graph (or can be formulated as such), and there are constructive linear time algorithms for the fixed parameter versions of the problems. Examples are cutwidth, pathwidth, and directed or weighted variants of these. However, these algorithms have complicated technical det...
متن کاملE cient Parallel Algorithms for Two Graph Layout Problems
We present e cient parallel algorithms for solving two graph layout problems: Find a F ary Embedding on a grid and construct a rectangular dual for planar graphs. The algorithm for the rst problem takes O(logn log n) time with O(n) processors on a PRAM. The algorithm for the second problem takes O(log 2 n) time with O(n) processors.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2009
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2008.10.003